Compression and Entropy
نویسندگان
چکیده
The connection between text compression and the measure of entropy of a source seems to be well known but poorly documented. We try to partially remedy this situation by showing that the topological entropy is a lower bound for the compression ratio of any compressor. We show that for factorial sources the 1978 version of the Ziv-Lempel compression algorithm achieves this lower bound.
منابع مشابه
Exergy and Energy Analysis of Diesel Engine using Karanja Methyl Ester under Varying Compression Ratio
The necessity for decrease in consumption of conventional fuel, related energy and to promote the use of renewable sources such as biofuels, demands for the effective evaluation of the performance of engines based on laws of thermodynamics. Energy, exergy, entropy generation, mean gas temperature and exhaust gas temperature analysis of CI engine using diesel and karanja methyl ester blends at d...
متن کاملEntropy Encoding in Wavelet Image Compression
In the process of wavelet image compression, there are three major steps that makes the compression possible, namely, decomposition, quantization and entropy encoding steps. While quantization may be a lossy step where some quantity of data may be lost and may not be recovered, entropy encoding enables a lossless compression that further compresses the data. [13], [18], [5] In this paper we dis...
متن کاملTowards Development of Efficient Compression Techniques for Different Types of Source Data
This Chapter summarizes and concludes our research work. Our work is mainly in the area of lossless data compression using arithmetic coding. Arithmetic coding is used to compress any type of source data. It falls under entropy coding compression methods and is most widely used as a replacement of Huffman encoding entropy method due to its nearly optimal entropy. It is also used with most of th...
متن کاملCombinatorial Entropy Encoding
This paper proposes a novel entropy encoding technique for lossless data compression. Representing a message string by its lexicographic index in the permutations of its symbols results in a compressed version matching Shannon entropy of the message. Commercial data compression standards make use of Huffman or arithmetic coding at some stage of the compression process. In the proposed method, l...
متن کاملMiminum Entropy Set Cover Problem for Lossy Data Compression
Classical minimum entropy set cover problem relies on the finding the most likely assignment between the set of observations and the given set of their types. The solution is described by such partition of data space which minimizes the entropy of the distribution of types. The problem finds a natural application in the machine learning, clustering and data classification. In this paper we show...
متن کامل